https://nova.newcastle.edu.au/vital/access/ /manager/Index ${session.getAttribute("locale")} 5 Large interconnection networks with given degree and diameter https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:19143 Wed 11 Apr 2018 15:42:23 AEST ]]> The metric dimension of the circulant graph C(n,±{1,2,3,4}) https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:33940 Wed 04 Sep 2019 10:04:28 AEST ]]> On the partition dimension of circulant graphs https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:31515 v of a connected graph G (V, E) and a subset S of V, the distance between v and S is defined by d(v,S)=min{d(v,x):x∈S}. For an ordered k.-partition Π={S1,S2,…,Sk} of V, the representation of v with respect to Π is the k-vector r(v∣Π)=(d(v,S1),d(v,S2),…,d(v,Sk)). The k-partition Π is a resolving partition if the k-vectors r(v∣Π), v∈V are distinct. The minimum k for which there is a resolving k-partition of V is the partition dimension of G. In this paper, we obtain the partition dimension of circulant graphs [formula cannot be replicated]]]> Sat 24 Mar 2018 08:43:35 AEDT ]]> On the partition dimension of a class of circulant graphs https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:17583 Sat 24 Mar 2018 08:03:58 AEDT ]]> Searching for large multi-loop networks https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:19509 Sat 24 Mar 2018 08:02:18 AEDT ]]> On the metric dimension of circulant and Harary graphs https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:19436 Sat 24 Mar 2018 07:51:58 AEDT ]]>